Modulus-based GSTS Iteration Method for Linear Complementarity Problems
نویسندگان
چکیده
منابع مشابه
Modulus-based GSTS Iteration Method for Linear Complementarity Problems
In this paper, amodulus-based generalized skew-Hermitian triangular splitting (MGSTS) iteration method is present for solving a class of linear complementarity problems with the system matrix either being an H+-matrix with non-positive off-diagonal entries or a symmetric positive definite matrix. The convergence of the MGSTS iterationmethod is studied in detail. By choosing different parameters...
متن کاملModulus-based synchronous multisplitting iteration methods for linear complementarity problems
To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an H+-matrix, which improve the existing converg...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملGlobal Modulus-Based Synchronous Multisplitting Multi-Parameters TOR Methods for Linear Complementarity Problems
In 2013, Bai and Zhang constructed modulus-based synchronous multisplitting methods for linear complementarity problems and analyzed the corresponding convergence. In 2014, Zhang and Li studied the weaker convergence results based on linear complementarity problems. In 2008, Zhang et al. presented global relaxed non-stationary multisplitting multi-parameter method by introducing some parameters...
متن کاملiteration primal - dual path - following method , based on wide neighborhoods and large updates , for monotone linear complementarity problems
In this paper we propose a new class of primal-dual path-following interior point algorithms for solving monotone linear complementarity problems. At each iteration, the method would select a target on the central path with a large update from the current iterate, and then the Newton method is used to get the search directions, followed by adaptively choosing the step sizes, which are e.g. the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Study
سال: 2015
ISSN: 1006-6837,2617-8702
DOI: 10.4208/jms.v48n1.15.01